Fast greedy optimization of sensor selection in measurement with correlated noise

نویسندگان

چکیده

A greedy algorithm is proposed for sparse-sensor selection in reduced-order sensing that contains correlated noise measurement. The sensor carried out by maximizing the determinant of Fisher information matrix a Bayesian estimation operator.The with covariance measurement and prior probability distribution estimating parameters, which are given modal decomposition high dimensional data, robustly works even presence noise. After computational efficiency improved low-rank approximation matrix, algorithms applied to various problems. method yields more accurate reconstruction than previously presented determinant-based algorithm, reasonable increase time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

evidence of adverse selection in irans health insurance market

در این تحقیق به مطالعه وجود انتخاب نامساعد(کژ گزینی) در بازار بیمه درمان تکمیلی ایران پرداخته شده است. داده های مورد نیاز توسط پرسشنامه و به روش نمونه گیری خوشه ای جمع آوری شده است. پرسشنامه ها در میان افراد شاغل ساکن شهر تهران توریع شد. در این تحقیق با استفاده از تخمین دو مدل لجستیک و به دست آوردن ضریب همبستگی میان تقاضای بیمه درمان تکمیلی و رخداد خسارت به بررسی موضوع مورد نظر پرداخته شده است....

15 صفحه اول

Minimum Power Parameter Estimation in Sensor Network with Correlated Sensor Noise

We consider the problem of a single parameter estimation by a sensor network with a fusion center (FC). Sensor observations are corrupted by additive noises which can have arbitrary spatial correlation. Due to a bandwidth constraint each sensor is only able to transmit a finite number of bits. The fusion center combines messages from the sensors to produce a parameter estimator, which is requir...

متن کامل

A Fast Greedy Algorithm for Generalized Column Subset Selection

This paper defines a generalized column subset selection problem which is concerned with the selection of a few columns from a source matrix A that best approximate the span of a target matrix B. The paper then proposes a fast greedy algorithm for solving this problem and draws connections to different problems that can be efficiently solved using the proposed algorithm. 1 Generalized Column Su...

متن کامل

Capacitance Position Sensor for LISA Noise Measurement

This paper discusses two techniques investigated for use in a capacitance-based position sensor for the Eöt-Wash LISA noise measurement. The advantages and disadvantages of both techniques are reviewed and some elementary mathematical analysis is presented. A prototype implementation based on the more successful of the two techniques has been constructed.

متن کامل

On an Optimization Problem in Sensor Selection*

We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cost c A associated with each set A of sensors that is a subset of G. Given any set of sensors that is a subset of G, it is possible to determine, via a test, whether the resulting system-sensor combination possesses Pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mechanical Systems and Signal Processing

سال: 2021

ISSN: ['1096-1216', '0888-3270']

DOI: https://doi.org/10.1016/j.ymssp.2021.107619